منابع مشابه
SOM-based similarity index measure: quantifying interactions between multivariate structures
This paper addresses the issue of quantifying asymmetric functional relationships between signals. We specifically consider a previously proposed similarity index that is conceptually powerful, yet computationally very expensive. The complexity increases with the square of the number of samples in the signals. In order to counter this difficulty, a self-organizing map that is trained to model t...
متن کاملImproved similarity scores for comparing motifs
MOTIVATION A question that often comes up after applying a motif finder to a set of co-regulated DNA sequences is whether the reported putative motif is similar to any known motif. While several tools have been designed for this task, Habib et al. pointed out that the scores that are commonly used for measuring similarity between motifs do not distinguish between a good alignment of two informa...
متن کاملQuantifying the time course of similarity
Does the similarity between two items change over time? Previous studies (Goldstone & Medin, 1994; Gentner & Brem, 1999) have found suggestive results but have relied on interpreting complex interaction effects from “deadline” decision tasks in which the decision making process is not well understood (Luce, 1986). Using a self-paced simple decision task in which the similarity between two items...
متن کاملQuantifying Internet End-to-End Route Similarity
Route similarity refers to the similarity of two routes between two nodes and an arbitrary third node. This intuitive concept plays an important role in distributed system deployment and path-edge inference. However, route similarity has not been quantitatively studied from an end-node perspective, and its properties are poorly understood. In this paper, we make an initial effort in quantifying...
متن کاملToward Quantifying Vertex Similarity in Networks
Vertex similarity is a major problem in network science with a wide range of applications. In this work we provide novel perspectives on finding (dis)similar vertices within a network and across two networks with the same number of vertices (graph matching). With respect to the former problem, we propose to optimize a geometric objective which allows us to express each vertex uniquely as a conv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Genome Biology
سال: 2007
ISSN: 1465-6906
DOI: 10.1186/gb-2007-8-2-r24